On convexification of polygons by pops

نویسندگان

  • Adrian Dumitrescu
  • Evan Hilscher
چکیده

Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an open problem posed by Demaine and O’Rourke [9, Open Problem 5.3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexification of polygons by flips and by flipturns

Simple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons.

متن کامل

Vertex Pops and Popturns

This paper considers transformations of a planar polygon P according to two types of operations. A vertex pop (or a pop) reflects a vertex vi, i ∈ {1, . . . , n}, across the line through the two adjacent vertices vi−1 and vi+1 (where index arithmetic is modulo n). A popturn rotates vi in the plane by 180◦ about the midpoint of the line segment vi−1vi+1. Pops and popturns are polygon reconfigura...

متن کامل

Extension of Completely Positive Cone Relaxation to Polynomial Optimization

We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...

متن کامل

B-471 Extension of Completely Positive Cone Relaxation to Polynomial Optimization

We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...

متن کامل

ساختار عاملی و ویژگی‌های روان‌سنجی مقیاس ادراکات والدینی(POPS) در دانش آموزان دبیرستانی

In this study with correlational design, the psychometric characteristics of the Perceptions of Parents scale (POPS; Robbins, 1994) were investigated. Sample of high school students (340 female and 320 male) in Bojnourd were selected with Cluster sampling and completed POPS and Smith`s self-esteem Questionnaire (1967). Cronbach `s Alpha, test-retest coefficient, exploratory and confirmatory fac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010